Two Projection Pursuit Algorithms for Machine Learning under Non-Stationarity

نویسنده

  • Duncan A. J. Blythe
چکیده

Acknowledgements I am most grateful to Professor K.-R.Müller for having provided me the opportunity, not only to gain research experience in his IDA/Machine Learning Laboratory but in addition for employing me to do so. Without his assistance I would not have been able to complete my degree at the BCCN and continue to the PhD level in a dignified manner. I have greatly appreciated having been treated as an equal member of his research group, despite my Master's student's status, in being assigned research tasks of genuine scientific import and interest. In addition, I most heartily thank Samek for imparting to me their knowledge of Machine Learning and Neuroscience during my first two years at the TU Berlin and for their enthusiasm for the topics which I have pursued in this thesis. Chapters 2 and 3 of this thesis are, in addition, the result of collaboration with Paul, Frank and Wojciech. In addition I would like to thank Franz Kiraly and Wojciech Samek, once again, as well as Alex Schlegel and Danny Pankin for their comments on the manuscript. Moreover, I thank the remaining, numerous members of the Machine Learning Group and the BCCN with whom I have discussed ideas relating to Neuroscience, Machine and Margret Franke for assisting me in the demanding task of completing my degree within the allotted two year period. Finally, I would like to thank my parents, for their continued support during the transition I have made to this field and to my girlfriend Michaela for helping me not to lose sight of the idealism which originally brought me to this field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructive Neural Network Algorithms That Solve Highly Non-separable Problems

Learning from data with complex non-local relations and multimodal class distribution for widely used classification algorithms is still very hard. Even if accurate solution is found the resulting model may be too complex for a given data and will not generalize well. New types of learning algorithms are needed to extend capabilities of standard machine learning systems. Projection pursuit meth...

متن کامل

Learning under Non-Stationarity: Covariate Shift and Class-Balance Change

One of the fundamental assumptions behind many supervised machine learning algorithms is that training and test data follow the same probability distribution. However, this important assumption is often violated in practice, for example, because of an unavoidable sample selection bias or non-stationarity of the environment. Due to violation of the assumption, standard machine learning methods s...

متن کامل

انجام یک مرحله پیش پردازش قبل از مرحله استخراج ویژگی در طبقه بندی داده های تصاویر ابر طیفی

Hyperspectral data potentially contain more information than multispectral data because of their higher spectral resolution. However, the stochastic data analysis approaches that have been successfully applied to multispectral data are not as effective for hyperspectral data as well. Various investigations indicate that the key problem that causes poor performance in the stochastic approaches t...

متن کامل

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

Fuzzy Multi-objective Permutation Flow Shop Scheduling Problem with Fuzzy Processing Times under Learning and Aging Effects

In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1110.0593  شماره 

صفحات  -

تاریخ انتشار 2011